منابع مشابه
On the approximability of Dodgson and Young elections
The voting rules proposed by Dodgson and Young are both designed to find the alternative closest to being a Condorcet winner, according to two different notions of proximity; the score of a given alternative is known to be hard to compute under either rule. In this paper, we put forward two algorithms for approximating the Dodgson score: an LP-based randomized rounding algorithm and a determini...
متن کاملParameterized Computational Complexity of Dodgson and Young Elections
We show that, other than for standard complexity theory with known NP-completeness results, the computational complexity of the Dodgson and Young election systems is completely different from a parameterized complexity point of view. That is, on the one hand, we present an efficient fixed-parameter algorithm for determining a Condorcet winner in Dodgson elections by a minimum number of switches...
متن کاملUnifying Parallels
I show that the equational treatment of ellipsis proposed in (Dalrymple et al., 1991) can further be viewed as modeling the effect of parallelism on semantic interpretation. I illustrate this claim by showing that the account straightforwardly extends to a general treatment of sloppy identity on the one hand, and to deaccented foci on the other. I also briefly discuss the results obtained in a ...
متن کاملUnifying Parallels
I show that the equational treatment of ellipsis proposed in (Dalrymple et al., 1991) can further be viewed as modeling the eeect of parallelism on semantic interpretation. I illustrate this claim by showing that the account straightforwardly extends to a general treatment of sloppy identity on the one hand, and to deaccented foci on the other. I also brieey discuss the results obtained in a pr...
متن کاملDetermining the Winner of a Dodgson Election is Hard
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we resolve two open problems regarding the parameterized complexity of DODGSON SCORE. We show that DODGSON SCORE parameterized by the target score value k has no polynomial kernel unless the polynomial hierarchy collapses to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1888
ISSN: 0028-0836,1476-4687
DOI: 10.1038/039175b0